Constrained Delaunay Triangulation for Ad Hoc Networks
نویسندگان
چکیده
منابع مشابه
Constrained Delaunay Triangulation for Ad Hoc Networks
Geometric spanners can be used for efficient routing in wireless ad hoc networks. Computation of existing spanners for ad hoc networks primarily focused on geometric properties without considering network requirements. In this paper we propose a new spanner called Constrained Delaunay Triangulation (CDT) which considers both geometric properties and network requirements. The CDT is formed by in...
متن کاملLocalized Delaunay Triangulation with Application in Ad Hoc Wireless Networks
Several localized routing protocols guarantee the delivery of the packets when the underlying network topology is a planar graph. Typically, relative neighborhood graph (RNG) or Gabriel graph (GG) is used as such planar structure. However, it is well-known that the spanning ratios of these two graphs are not bounded by any constant (even for uniform randomly distributed points). Bose et al. [11...
متن کاملConstrained Delaunay Triangulation Using Delaunay Visibility
An algorithm for constructing constrained Delaunay triangulation (CDT) of a planar straight-line graph (PSLG) is presented. Although the uniform grid method can reduce the time cost of visibility determinations, the time needed to construct the CDT is still long. The algorithm proposed in this paper decreases the number of edges involved in the computation of visibility by replacing traditional...
متن کاملLEBRP - A Lightweight and Energy Balancing Routing Protocol for Energy-Constrained Wireless Ad Hoc Networks
A wireless ad hoc network typically refers to any set of wireless networks where all devices have equal status on a network and are free to associate with any other wireless ad hoc network devices in their range. As the nature of these networks, they commonly do not have external power supplies, and each node has a limited internal power source. In this paper, we put forward a new routing proto...
متن کاملCapacity-Constrained Delaunay Triangulation for point distributions
Sample point distributions possessing blue noise spectral characteristics play a central role in computer graphics, but are notoriously difficult to generate. We describe an algorithm to very efficiently generate these distributions. The core idea behind our method is to compute a Capacity-Constrained Delaunay Triangulation (CCDT), namely, given a simple polygon P in the plane, and the desired ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer Systems, Networks, and Communications
سال: 2008
ISSN: 1687-7381,1687-739X
DOI: 10.1155/2008/160453